Krylov-subspace recycling via the POD-augmented conjugate-gradient algorithm
نویسندگان
چکیده
This work presents a new Krylov-subspace-recycling method for efficiently solving sequences of linear systems of equations characterized by a non-invariant symmetric-positive-definite matrix. As opposed to typical truncation strategies used in recycling such as deflation, we propose a truncation method inspired by goal-oriented proper orthogonal decomposition (POD) from model reduction. This idea is based on the observation that model reduction aims to compute a low-dimensional subspace that contains an accurate solution; as such, we expect the proposed method to generate a low-dimensional subspace that is well suited for computing inexact solutions. In particular, we propose specific goal-oriented POD ‘ingredients’ that align the optimality properties of POD with the objective of Krylov-subspace recycling. To compute solutions in the resulting ‘augmented’ POD subspace, we propose a hybrid direct/iterative three-stage iterative method that leverages (1) the optimal ordering of POD basis vectors, and (2) well-conditioned reduced matrices. Numerical experiments performed on real-world solid-mechanics problems highlight the benefits of the proposed method over standard approaches for Krylov-subspace recycling.
منابع مشابه
An Adaptive POD-Krylov Reduced-Order Model for Structural Optimization
1. Abstract We present an adaptive proper orthogonal decomposition (POD)-Krylov reduced-order model (ROM) for structural optimization. At each step of the optimization loop, we compute approximate solutions to the structural state and sensitivity equations using a novel POD-augmented conjugate gradient (CG) algorithm. This algorithm consists of three stages. In the first two stages, the solutio...
متن کاملRecycling Bi-Lanczos Algorithms: BiCG, CGS, and BiCGSTAB
Engineering problems frequently require solving a sequence of dual linear systems. This paper introduces recycling BiCG, that recycles the Krylov subspace from one pair of linear systems to the next pair. Augmented bi-Lanczos algorithm and modified two-term recurrence are developed for using the recycle space. Recycle space is built from the approximate invariant subspace corresponding to eigen...
متن کاملExtrapolation vs. projection methods for linear systems of equations
It is shown that the four vector extrapolation methods, minimal polynomial extrapolation, reduced rank extrapolation, modified minimal polynomial extrapolation, and topological epsilon algorithm, when applied to linearly generated vector sequences, are Krylov subspace methods, and are equivalent to some well known conjugate gradient type methods. A unified recursive method that includes the con...
متن کاملIterative Solution of Linear Systems
Recent advances in the eld of iterative methods for solving large linear systems are reviewed. The main focus is on developments in the area of conjugate gradient-type algorithms and Krylov subspace methods for non-Hermitian matrices .
متن کاملRobust Krylov-Subspace Methods for Passive Sonar Adaptive Beamforming
Krylov-subspace methods, such as the multistage Wiener filter and conjugate gradient method, are often used for reduced-dimension adaptive beamforming. These techniques do not, however, allow for steering vector mismatch, which is typically present in many applications of interest, including passive sonar. Here, we discuss recently proposed robust methods that do allow for steering vector misma...
متن کامل